Decrypted secrets - methods and maxims of cryptology
نویسنده
چکیده
Chapter 4 (Encryption Steps: Polygraphic Substitution and Coding) extends the preceding chapter by polygraphic ciphers, introducing bigraphic and trigraphic substitution and tomographic methods. As in the preceding chapter, there is a theoretical description of each method as well as a detailed explanation of the single steps of calculation using a concrete cipher as an example. These examples are supplemented by some historical information, allowing the reader to comprehend the circumstances of the development and the application of the encryption system.
منابع مشابه
How to Store some Secrets
This paper introduces a special type of symmetric cryptosystem called multi-encryption scheme. It allows users to encrypt multiple plaintexts into a single ciphertext. Each plaintext is protected with its own secret key, meaning that they can be decrypted individually by applying the decryption function with the corresponding key to the ciphertext. Compared to encrypting the ciphertexts one-by-...
متن کاملPrompted User Retrieval of Secret Entropy: The Passmaze Protocol
A prompting protocol permits users to securely retrieve secrets with greater entropy than passwords. The retrieved user secrets can have enough entropy to be used to derive cryptographic keys.
متن کاملA Recursive Threshold Visual Cryptography Scheme
This paper presents a recursive hiding scheme for 2 out of 3 secret sharing. In recursive hiding of secrets, the user encodes additional information about smaller secrets in the shares of a larger secret without an expansion in the size of the latter, thereby increasing the efficiency of secret sharing. We present applications of our proposed protocol to images as well as text.
متن کاملSecure Multiplication of Shared Secrets in the Exponent
We present a new protocol for the following task. Given tow secrets a, b shared among n players, compute the value g. The protocol uses the generic BGW approach for multiplication of shared secrets, but we show that if one is computing “multiplications in the exponent” the polynomial randomization step can be avoided (assuming the Decisional Diffie-Hellman Assumption holds). This results in a n...
متن کاملHow to share secrets simultaneously
Each member of a team consisting of n person has a secret. The k out of n simultaneous threshold secret sharing requires that any group of k members should be able to recover the secret of the other n−k members, while any group of k − 1 or less members should have no information on the secret of other team members. We show that when all secrets are independent and have size s then each team mem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997